Minimal spanning trees, filaments and galaxy clustering
نویسندگان
چکیده
منابع مشابه
Calorimeter Clustering with Minimal Spanning Trees
Clustering calorimeter hits is a complex pattern recognition problem with complexity depending on event type, energy and detector design. A successful clustering algorithm must be characterised by high efficiency and speed to cope with and to exploit the high granularity design forseen for both electromagnetic and hadronic calorimeters in a Future Linear Collider experiment. In the following we...
متن کاملPercolation and Minimal Spanning Trees
Consider a random set V n of points in the box n; n) d , generated either by a Poisson process with density p or by a site percolation process with parameter p. We analyse the empirical distribution function F n of the lengths of edges in a minimal (Euclidean) spanning tree T n on V n. We express the limit of F n , as n ! 1, in terms of the free energies of a family of percolation processes der...
متن کاملClustering with Minimum Spanning Trees
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set of representative points and removes edges that satisfy a predefined criterion. The process is repeat...
متن کاملCounting and Constructing Minimal Spanning Trees
We revisit the minimal spanning tree problem in order to develop a theory of construction and counting of the minimal spanning trees in a network. The theory indicates that the construction of such trees consists of many di erent choices, all independent of each other. These results suggest a block approach to the construction of all minimal spanning trees in the network, and an algorithm to th...
متن کاملManifold Learning with Geodesic Minimal Spanning Trees
In the manifold learning problem one seeks to discover a smooth low dimensional surface, i.e., a manifold embedded in a higher dimensional linear vector space, based on a set of measured sample points on the surface. In this paper we consider the closely related problem of estimating the manifold’s intrinsic dimension and the intrinsic entropy of the sample points. Specifically, we view the sam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Monthly Notices of the Royal Astronomical Society
سال: 1985
ISSN: 0035-8711,1365-2966
DOI: 10.1093/mnras/216.1.17